| 1. | On the subtrees of random binary search trees
随机二叉搜索树的子树 |
| 2. | A binary search tree is a binary tree with the following properties
二进制搜索树( bst )是具有以下属性的二进制树： |
| 3. | Binary search tree
二叉查找树 |
| 4. | Binary search trees are useful for finding items in a list that changes infrequently
二叉搜索树在查找经常变化的列表时是很非常有用的。 |
| 5. | Add and remove operations are typically expensive since binary search trees require that a tree be balanced
通常需要增加和删除操作，因为二叉树需要被平衡。 |
| 6. | Simple binary tree class - binary search trees are useful for finding items in a list that changes infrequently
二叉搜索树在查找经常变化的列表时是很非常有用的。 |
| 7. | The split of search space can be described as a virtue binary search tree and the info - search process is similar to the search in the binary tree
在此基础上，信息的搜索就可描述为二进制搜索树的查找过程。 |
| 8. | Using a binary search tree or dividing the string into segments as long as the square root of the length of the string will solve the problem
用一个二叉搜索树或者将串切分成长度的平方根那么长的小段都可以解决这个问题。 |
| 9. | In the above example , a simple hashmap or binary search tree could have easily solved the problem , but implementing one of these data structures in xsl would be inconvenient and unnecessary
在上面的示例中，如果使用一个简单的散列图（ hashmap ）或二进制搜索树就可以轻易地解决问题，但是用xsl实现一个这样的数据结构并不是很方便，并且是不必要的。 |
